Self-similar real trees defined as fixed points and their geometric properties

Fixed Points in Self–Similar Analysis of Time Series

Two possible definitions of fixed points in the self–similar analysis of time series are considered. One definition is based on the minimal– difference condition and another, on a simple averaging. From studying stock market time series, one may conclude that these two definitions are practically equivalent. A forecast is made for the stock market indices for the end of March 1998. Time series ...

Mobs, Trees, and Fixed Points

Nonexpansive mappings on complex C*-algebras and their fixed points

A normed space $mathfrak{X}$ is said to have the fixed point property, if for each nonexpansive mapping $T : E longrightarrow E $ on a nonempty bounded closed convex subset $ E $ of $ mathfrak{X} $ has a fixed point. In this paper, we first show that if $ X $ is a locally compact Hausdorff space then the following are equivalent: (i) $X$ is infinite set, (ii) $C_0(X)$ is infinite dimensional, (...

Diagonal arguments and fixed points

‎A universal schema for diagonalization was popularized by N.S‎. ‎Yanofsky (2003)‎, ‎based on a pioneering work of F.W‎. ‎Lawvere (1969)‎, ‎in which the existence of a (diagonolized-out and contradictory) object implies the existence of a fixed-point for a certain function‎. ‎It was shown that many self-referential paradoxes and diagonally proved theorems can fit in that schema‎. ‎Here‎, ‎we fi...

On univoque points for self-similar sets

Let K ⊆ R be the unique attractor of an iterated function system. We consider the case where K is an interval and study those elements of K with a unique coding. We prove under mild conditions that the set of points with a unique coding can be identified with a subshift of finite type. As a consequence of this, we can show that the set of points with a unique coding is a graph-directed selfsimi...